Angewandten Mathematik An Inexact QP - based Method for Nonlinear Complementarity Problems
نویسندگان
چکیده
We consider a quadratic programming-based method for nonlinear complementarity problems which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection are also reported.
منابع مشابه
An inexactQP-based method for nonlinear complementarity problems
We consider a quadratic programming-based method for nonlinear complementarity problems which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection ...
متن کاملHamburger Beitrage zur Angewandten Mathematik Beyond Montonicity in Regularization Methods for Nonlinear Complementarity Problems
Regularization methods for the solution of nonlinear complementarity problems are standard methods for the solution of monotone complementarity problems and possess strong convergence properties. In this paper, we replace the monotonicity assumption by a P0-function condition. We show that many properties of regularization methods still hold for this larger class of problems. However, we also p...
متن کاملA nonsmooth inexact Newton method for the solution oflarge - scale nonlinear complementarity
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a nonsmooth equation reformulation of the complementarity problem and on an inexact Levenberg-Marquardt-type algorithm for its solution. Under mild assumptions, and requiring only the approximate solution of a linear system at each iteration, the algorithm is shown to be b...
متن کاملA New Hybrid Inexact Logarithmic-Quadratic Proximal Method for Nonlinear Complementarity Problems
In this paper, the authors present and analyze a new hybrid inexact Logarithmic-Quadratic Proximal method for solving nonlinear complementarity problems. Each iteration of the new method consists of a prediction and a correction step. The predictor is produced using an inexact Logarithmic-Quadratic Proximal method, which is then corrected by the Proximal Point Algorithm. The new iterate is obta...
متن کاملNumerical validation of solutions of linear complementarity problems
This paper proposes a validation method for solutions of linear complementarity problems. The validation procedure consists of two sufficient conditions that can be tested on a digital computer. If the first condition is satisfied then a given multidimensional interval centered at an approximate solution of the problem is guaranteed to contain an exact solution. If the second condition is satis...
متن کامل